A Concurrent and Compositional Petri Net Semantics of Preemption
نویسندگان
چکیده
The aim of this paper is the introduction of preemption in a compositional model, called M-nets, which is based on Petri nets and hence provided with a concurrent semantics. We propose a way to model preemptible systems by extending the M-net model with priorities and the M-net algebra with a preemption operator. We show that these extensions can be seen as a high-level version of the well studied model of priority systems, and so, can be reduced to Petri nets (without priorities) which retain as much as possible of the original concurrency. As a consequence, Petri nets appear as a model powerful enough to deal with preemption in a compositional way and with a concurrent semantics.
منابع مشابه
B(PN)2 - a Basic Petri Net Programming Notation
This paper presents the syntax of a concurrent programming notation which integrates a variety of process interaction techniques, its compositional Petri net semantics via the Box calculus, and an example of using the semantics for program verification.
متن کاملA Class of Composable and Preemptible High-level Petri Nets with an Application to Multi-Tasking Systems
This paper presents an extension of an algebra of high-level Petri nets with operations for suspension and abortion. These operations are sound with respect to the semantics of preemption, and can be applied to the modelling of the semantics of highlevel parallel programming languages with preemption-related features. As an illustration, the paper gives an application to the modelling of a mult...
متن کاملA Concurrent Semantics of Static Exceptions in a Parallel Programming Language
This paper aims at introducing a mechanism of exceptions in a parallel programming language, giving them a formal concurrent semantics in terms of preemptible and composable high-level Petri nets. We show that, combined with concurrency, exceptions can be used as a basis for other preemption related constructs. We illustrate this idea by presenting a generalized timeout and a simple UNIX-like s...
متن کاملA Compositional Petri Net Semantics for SDL
In this paper a compositional high-level Petri net semantics for SDL (Speciication and Description Language) is presented. Emphasis is laid on the modelling of dynamic creation and termination of processes and of procedures { features, which are, for instance, essential for typical client-server systems. In a preliminary paper we have already shown that we are able to usèstate of the art' verii...
متن کاملM - nets : an Algebra of High - level Petri Nets , with an Application to the Semantics ofConcurrent Programming
This paper describes a high-level Petri net model called M-nets (for modular multilabelled nets). A distinctive feature of this model is that it allows both: unfolding, as do most other high-level net models; and composition { in particular, synchronisation { in a process algebraic style, turning the set of M-nets into an algebraic domain. It turns out that the composition operations of this do...
متن کامل